The convex hull of two core capacitated network design problems
نویسندگان
چکیده
منابع مشابه
The convex hull of two core capacitated network design problems
The network loading problem (NLP) is a specialized capacitated network design problem in which prescribed point-to-point demand between various pairs of nodes of a network must be met by installing (loading) a capacitated facility. We can load any number of units of the facility on each of the arcs at a specified arc dependent cost. The problem is to determine the number of facilities to be loa...
متن کاملCapacitated facility location/network design problems
We introduce a combined facility location/network design problem in which facilities have constraining capacities on the amount of demand they can serve. This model has a number of applications in regional planning, distribution, telecommunications, energy management, and other areas. Our model includes the classical capacitated facility location problem (CFLP) on a network as a special case. W...
متن کاملAdaptive Algorithms for Planar Convex Hull Problems
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper we generalize the framework to geometric problems. To this end, we think of geometric problems as permutation (or rearranging) problems of arrays, and define the “presortedness” as a distance from the input array to t...
متن کاملA branch-and-cut algorithm for capacitated network design problems
We present a branch-and-cut algorithm to solve capacitated network design problems. Given a capacitated network and point-to-point traac demands, the objective is to install more capacity on the edges of the network and route traac simultaneously, so that the overall cost is minimized. We study a mixed-integer programming formulation of the problem and identify some new facet deening inequaliti...
متن کاملStrong inequalities for capacitated survivable network design problems
We present several classes of facet-deening inequalities to strengthen polyhedra arising as subsystems of network design problems with survivability constraints. These problems typically involve assigning capacities to a network with multicommodity demands, such that after a vertex-or edge-deletion at least some prescribed fraction of each demand can be routed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1993
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01580612